Relaxed Schrödinger Bridges and Robust Network Routing
نویسندگان
چکیده
منابع مشابه
Quantum Schrödinger Bridges
we develop a simplified version of a variational principle within Nelson stochas-tic mechanics that produces the von Neumann wave packet reduction after a position measurement. This stochastic control problem parallels, with a different kinematics, the problem of the Schrödinger bridge. This gives a profound meaning to what was observed by Schrödinger in 1931 concerning Schrödinger bridges: " M...
متن کاملRouting Bridges (RBridges): Appointed Forwarders
The IETF TRILL (TRansparent Interconnection of Lots of Links) protocol provides least cost pair-wise data forwarding without configuration in multi-hop networks with arbitrary topology, safe forwarding even during periods of temporary loops, and support for multipathing of both unicast and multicast traffic. TRILL accomplishes this by using IS-IS (Intermediate System to Intermediate System) lin...
متن کاملRobust Subspace Discovery via Relaxed Rank Minimization
This letter examines the problem of robust subspace discovery from input data samples (instances) in the presence of overwhelming outliers and corruptions. A typical example is the case where we are given a set of images; each image contains, for example, a face at an unknown location of an unknown size; our goal is to identify or detect the face in the image and simultaneously learn its model....
متن کاملRouting Bridges (RBridges): Base Protocol Specification
Routing Bridges (RBridges) provide optimal pair-wise forwarding without configuration, safe forwarding even during periods of temporary loops, and support for multipathing of both unicast and multicast traffic. They achieve these goals using IS-IS routing and encapsulation of traffic with a header that includes a hop count. RBridges are compatible with previous IEEE 802.1 customer bridges as we...
متن کاملThe robust network loading problem with dynamic routing
The Robust Network Loading Problem (RNL) can be stated as follows. Given a graph and a set of traffic matrices, install minimum cost integer capacities on the edges such that all the matrices can be routed non simultaneously on the network. The routing scheme is said to be dynamic if we can choose a (possibly) different routing for every matrix, it is called static if the routing must be the sa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2020
ISSN: 2325-5870,2372-2533
DOI: 10.1109/tcns.2019.2935623